Regular matrix polynomials with given spectral data
نویسندگان
چکیده
منابع مشابه
Linearization of regular matrix polynomials
This note contains a short review of the notion of linearization of regular matrix polynomials. The objective is clarification of this notion when the polynomial has an “eigenvalue at infinity”. The theory is extended to admit reduction by locally unimodular analytic matrix functions.
متن کاملSpectral Sparsification of Random-Walk Matrix Polynomials
We consider a fundamental algorithmic question in spectral graph theory: Compute a spectral sparsifier of a random-walk matrix-polynomial
متن کاملSpectral Bounds for Matrix Polynomials with Unitary Coefficients
It is well known that the eigenvalues of any unitary matrix lie on the unit circle. The purpose of this paper is to prove that the eigenvalues of any matrix polynomial, with unitary coefficients, lie inside the annulus A 1 2 ,2 (0) := { z ∈ C | 1 2 < |z| < 2 } . The foundations of this result rely on an operator version of Rouché’s theorem and the intermediate value theorem.
متن کاملMulti-parameter Polynomials with Given Galois Group
The non-Abelian finite simple groups and their automorphism groups play a crucial role in an inductive approach to the inverse problem of Galois theory. The rigidity method (see, for example, Malle and Matzat, 1999) has proved very efficient for deducing the existence of Galois extensions with such groups, as well as for the construction of polynomials generating such extensions. Nevertheless, ...
متن کاملOn the distance from a matrix polynomial to matrix polynomials with two prescribed eigenvalues
Consider an n × <span style="fon...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1989
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(16)30317-2